class Solution {
    public String makeSmallestPalindrome(String s) {
      char[] array = s.toCharArray() ;
      int i = 0 ; 
      int j = array.length - 1;
        while(i < j){
         if(array[i]<array[j]){
            array[j] = array[i];
         }else{
             array[i] = array[j] ;
         }
         i++ ;
         j-- ;
        }
       return new String(array) ;

    }
}